Prêt à Voter with Confirmation Codes
نویسنده
چکیده
A scheme is presented in which a Pretty Good Democracy style acknowledgement code mechanism is incorporated into Prêt à Voter. The idea is to provide voters with an immediate, and usable, confirmation at the time of casting of the correct registration of their receipt on the Web Bulletin Board. As with PGD, the registration and revelation of the confirmation code is performed by a threshold set of Trustees. Verification of the registration of the vote is now part of the vote casting and therefore more immediate and convenient for the voters. The scheme presented here is thus more convenient while maintaining the level of verifiability of conventional Prêt à Voter. It also means that we are less reliant on the diligence of voters in later performing checks on the Bulletin Board. It seems probable that this confirmation code mechanism will provide voters with greater confidence that their vote will be accurately tallied.
منابع مشابه
Sigma Ballots
We present Sigma ballots, a new type of ballot designed to be used in secure elections. Sigma ballots use the random order of candidates introduced by Prêt à Voter, combined with the confirmation codes of Scantegrity II. These ballots can be produced by a DRE machine with a slightly modified VVPAT, or can be similar to optical scan ballots. Sigma ballots work in conjunction with existing public...
متن کاملAuthentication Codes
The Prêt à Voter end-to-end verifiable voting system makes use of receipts, retained by voters, to provide individual verifiability that their vote has been recorded as cast. The paper discusses issues around the production and acceptance of receipts, and presents an alternative approach to individual verifiability based on Authentication Codes. These codes are constructed, in the encrypted dom...
متن کاملFaster Print on Demand for Prêt à Voter
Printing Prêt à Voter ballots on demand is desirable both for convenience and security. It allows a polling station to serve numerous different ballots, and it avoids many problems associated with the custody of the printouts. This paper describes a new proposal for printing Prêt à Voter ballots on demand. The emphasis is on computational efficiency suitable for real elections, and on very gene...
متن کاملProving Prêt à Voter Receipt Free Using Computational Security Models
Prêt à Voter is a supervised, end-to-end verifiable voting scheme. Informal analyses indicate that, subject to certain assumptions, Prêt à Voter is receipt free, i.e. a voter has no way to construct a proof to a coercer of how she voted. In this paper we propose a variant of Prêt à Voter and prove receipt freeness of this scheme using computational methods. Our proof shows that if there exists ...
متن کاملParallel Shuffling and Its Application to Prêt à Voter
We consider the problem of verifiable parallel shuffling in which the same shuffle is simultaneously performed on two or more lists of input ciphertexts, each list encrypted under a different key. We present three parallelisations of shuffle proofs from different paradigms. The properties of each protocol are analyzed and contrasted, and their suitability for electronic voting discussed. We sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011